Building Greibach Normal Form Grammars Using Genetic Algorithms

Grammatical inference of context-free grammars using positive and negative language examples is among the most challenging task in modern artificial natural technology. Recently, several implementations combining various techniques, usually including Backus–Naur form, have been proposed. In this paper, we explore a new implementation grammatical evolution methods focused on Greibach normal form exploiting its properties, also propose solutions both evolutionary processes corresponding fitness estimation.